A Wowzer-type lower bound for the strong regularity lemma
نویسندگان
چکیده
منابع مشابه
A Wowzer-Type Lower Bound for the Strong Regularity Lemma
The regularity lemma of Szemerédi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite graphs are. Alon, Fischer, Krivelevich and Szegedy obtained a powerful variant of the regularity lemma, which allows one to have an arbitrary control on this ...
متن کاملA tight lower bound for Szemerédi's regularity lemma
Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemerédi’s regularity lemma.
متن کاملA short proof of Gowers' lower bound for the regularity lemma
A celebrated result of Gowers states that for every > 0 there is a graph G such that every -regular partition of G (in the sense of Szemerédi’s regularity lemma) has order given by a tower of exponents of height polynomial in 1/ . In this note we give a new proof of this result that uses a construction and proof of correctness that are significantly simpler and shorter.
متن کاملAn Improved lower bound for arithmetic regularity
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemeredi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all its nontrivial Fourier coefficients are ...
متن کاملTwo Constructions for Tower-Type Lower Bounds of Szemerédi’s Regularity Lemma
The theory of random graph is one of the most important theories in modern combinatorics and theoretical computer science. This naturally leads to the following question: what is the essential property of a random graph? How can we distinguish a given graph from a random graphs? This leads to the development of pseudo-random graph theory (quasi-random graphs). [2] gives a complete survey on pse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2012
ISSN: 0024-6115
DOI: 10.1112/plms/pds045